Computers and Symbols versus Nets and Neurons
نویسنده
چکیده
1 These notes are currently under review for publication by UCL Press Limited in the UK. Duplication of this draft is permitted by individuals for personal use only. A n y other form of duplication or reproduction requires prior written permission of the author. This statement m ust be easily visible on the rst page of any reproduced copies. I would be happy to receive a n y comments you might h a ve on this draftt send them to me via electronic mail at [email protected]. I am particularly interested in hearing about things that you found diicult to learn or that weren't adequately explained, but I am also interested in hearing about inaccuracies, typos, or any other constructive criticism you might h a ve. 1 1 Neural net: A preliminary deenition To set the scene it is useful to give a d e n i t i o n o f w h a t w e m e a n b y `Neural Net'. However, it is the object of the course to make clear the terms used in this deenition and to expand considerably on its content. A Neural Netwo r k i s a n i n terconnected assembly of simple processing elements, units or nodes, whose functionality is loosely based on the animal neuron. The processing ability of the network is stored in the inter-unit connection strengths, or weights, obtained by a process of adaptation to, or learning from, a set of training patterns. In order to see how v ery diierent this is from the processing done by conventional computers it is worth examining the underlying principles that lie at the heart of all such machines. 2 The von Neumann machine and the symbolic paradigm The operation of all conventional computers may be modelled in the following way memory central processing unit instructions and data data von-Neumann machine The computer repeatedly performs the following cycle of events 1. fetch an instruction from memory. 2. fetch a n y data required by the instruction from memory. 3. execute the instruction (process the data). 4. store results in memory. 5. go back t o s t e p 1). 2 What problems can this method solve easily? It is possible to formalise many problems in terms of an algorithm, that is as a well deened procedure or recipe which will guarantee the answer. For example, the …
منابع مشابه
A Formal Petri Net Based Model for Antivirus Update Agent System
In this paper, a formal model for antivirus update agent system is presented based on mobile agent technology and predicate/transition Petri nets. The mobile agent system contains two mobile agents called DCA and UNA. It sends out agents to update antivirus on client computers in a network. Each agent takes on a specified responsibility. First, DCA roams through the network and check the last d...
متن کاملA Formal Petri Net Based Model for Antivirus Update Agent System
In this paper, a formal model for antivirus update agent system is presented based on mobile agent technology and predicate/transition Petri nets. The mobile agent system contains two mobile agents called DCA and UNA. It sends out agents to update antivirus on client computers in a network. Each agent takes on a specified responsibility. First, DCA roams through the network and check the last d...
متن کاملCounting with Neurons: Rule Application with Nets of Fatiguing Leaky Integrate and Fire Neurons
This paper shows a system that performs simple symbolic processing. The system is based entirely on fatiguing Leaky Integrate and Fire neurons, a coarse model of neurons. Following Hebb, the symbols are encoded by neurons that form Cell Assemblies. Additionally simple rules of the form ifX → X+1 are encoded by Cell Assemblies, and this symbolic computation is performed. Finally, a more complex ...
متن کاملRegular expressions over generalized alphabet and design of logical nets
Regular expressions over the so called generalized alphabet are introduced. The symbols of this alphabet are interpreted as sets of input states of a finite automaton instead of these states alone. The symbols may correspond e.g. to signals on individual input channels of a multipleinput device. A synthesis procedure using derivatives of expressions is shown. This procedure leads from regular e...
متن کاملDeriving Petri Nets for Finite Transition Systems
This paper presents a novel method to derive a Petri Net from any specification model that can be mapped into a statebased representation with arcs labeled with symbols from an alphabet of events (a Transition System, TS). The method is based on the theory of regions for Elementary Transition Systems (ETS). Previous work has shown that, for any ETS, there exists a Petri Net with minimum transit...
متن کامل: Computers and Symbols versus Nets and Neurons 5 Non-binary Signal Communication N Time Slots N 1 '1's or Pulses Probability of a '1' or Pulse Approx. N 1 / N Pulse Stream 2: Tlus and Vectors -simple Learning Rules
1 These notes are currently under review for publication by UCL Press Limited in the UK. Duplication of this draft is permitted by individuals for personal use only. Any other form of duplication or reproduction requires prior written permission of the author. This statement must be easily visible on the rst page of any reproduced copies. I would be happy to receive any comments you might have ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006